Weighted estimates for the multilinear maximal function on the upper half‐spaces

For a general dyadic grid, we give a Calderón–Zygmund type decomposition, which is the principle fact about the multilinear maximal function on the upper half‐spaces. Using the decomposition, we study the boundedness of . We obtain a natural extension to the multilinear setting of Muckenhoupt's weak‐type characterization. We also partially obtain characterizations of Muckenhoupt's strong‐type inequalities with one weight. Assuming the reverse Hölder's condition, we get a multilinear analogue of Sawyer's two weight theorem. Moreover, we also get Hytönen–Pérez type weighted estimates.     

Applications of Markov spectra for the weighted partition network by the substitution rule

The weighted self-similar network is introduced in an iterative way. In order to understand the topological properties of the self-similar network, we have done a lot of research in this field.Firstly, according to the symmetry feature of the self-similar network, we deduce the recursive relationship of its eigenvalues at two successive generations of the transition-weighted matrix.Then, we obtain eigenvalues of the Laplacian matrix from these two successive generations.Finally, we calculate an accurate expression for the eigentime identity and Kirchhoff index from the spectrum of the Laplacian matrix.     

An Improved Composite Multiscale Fuzzy Entropy for Feature Extraction of MI-EEG

Motor Imagery Electroencephalography (MI-EEG) has shown good prospects in neurorehabilitation, and the entropy-based nonlinear dynamic methods have been successfully applied to feature extraction of MI-EEG. Especially based on Multiscale Fuzzy Entropy (MFE), the fuzzy entropies of the τ coarse-grained sequences in τ scale are calculated and averaged to develop the Composite MFE (CMFE) with more feature information. However, the coarse-grained process fails to match the nonstationary characteristic of MI-EEG by a mean filtering algorithm. In this paper, CMFE is improved by assigning the different weight factors to the different sample points in the coarse-grained process, i.e., using the weighted mean filters instead of the original mean filters, which is conductive to signal filtering and feature extraction, and the resulting personalized Weighted CMFE (WCMFE) is more suitable to represent the nonstationary MI-EEG for different subjects. All the WCMFEs of multi-channel MI-EEG are fused in serial to construct the feature vector, which is evaluated by a back-propagation neural network. Based on a public dataset, extensive experiments are conducted, yielding a relatively higher classification accuracy by WCMFE, and the statistical significance is examined by two-sample t-test. The results suggest that WCMFE is superior to the other entropy-based and traditional feature extraction methods.     

具有重值分担的亚纯函数

在考虑重值分担的情况下,得到一个具有三个分担值的亚纯函数的唯一性定理及若干推论,推广并改进了仪洪勋、Lah iri等人的结果.     

CAMWI: Detecting protein complexes using weighted clustering coefficient and weighted density

Detection of protein complexes is very important to understand the principles of cellular organization and function. Recently, large protein–protein interactions (PPIs) networks have become available using high-throughput experimental techniques. These networks make it possible to develop computational methods for protein complex detection. Most of the current methods rely on the assumption that protein complex as a module has dense structure. However complexes have core-attachment structure and proteins in a complex core share a high degree of functional similarity, so it expects that a core has high weighted density. In this paper we present a Core-Attachment based method for protein complex detection from Weighted PPI Interactions using clustering coefficient and weighted density. Experimental results show that the proposed method, CAMWI improves the accuracy of protein complex detection.     

轨形Gromov-Witten不变量沿光滑点的加权涨开公式

本文考虑,当一个紧辛轨形群胚(X,ω)沿着光滑点作加权涨开时,它的形如<α_1,…,α_m,[pt]>_(g,A)~X的轨形Gromov-Witten不变量的变化公式,其中[pt]∈H_(dR)~(2n)(X)是生成元,dimX=2n.我们证明了对于非零A∈H_2(|X|,Z),<α_1,…,α_m,[pt]>_(g,A)~X={_(g_1,pl(A)-e’)~xdimX=4,g≥0,∑((-1)g_1·2)/(2g_1+2)!_(g_2,pl(A)-e’)~xdimX=6,g≥0,_(g_1,pl(A)-e’)~xdimX≥8,g=0其中x是X沿一光滑点的权α=(α_1,…,α_n)的加权涨开,且α_1≥α_i,2≤i≤n.     

一类具有资源约束和优先加工顺序约束极小化加权总完工时间调度优化问题研究

本文针对工件间具有链状优先约束和relocation资源约束的极小化加权总完工时间调度优化问题展开研究.针对这一NP难问题,利用relocation约束的性质和贪婪算法的思想,设计了一个多项式近似算法,并证明了当链不可中断,每个链具有相同工件数和工件间具有相同加工时间时,2为该算法的紧界.     

不同权的Bloch型空间之间的加权复合算子再刻画

本文研究了单位圆中从空间β_L到β_α的加权复合算子uC_φ为有界算子和紧算子的条件.利用阶估计等方法,获得了有界性和紧性的简捷充要条件,推广了叶善力的相应结果.